A New Algorithm for Finding a Minimum Dominating Set of Graphs
نویسندگان
چکیده
منابع مشابه
A New Algorithm for Finding a Minimum Dominating Set of Graphs
Harary, F. , 1997 Graph Theory, Narosa Publishing House. Arumugam, S. , Joseph, J. P. 1999 On graphs with equal domination and connected domination numbers, Discrete Mathematics vol. 206, 45-49. Deo, N. 2005 Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall of India Private Limited. Saoud, M. , Jebran, J. 2009 Finding A Minimum Dominating Set by Transforming Domi...
متن کاملA Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
A dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \D has at least one neighbour in D. Moreover if D is an independent set, i.e. no vertices in D are pairwise adjacent, then D is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dom...
متن کاملAn Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs
Given a permutation graph G with its corresponding permutation , we present an algorithm for nding a minimum cardinality dominating set for G. Our algorithm runs in O(n) time in amortized sense where n is the number of vertices in G. Hence, it is optimal. The best previous result is an O(n log log n) algorithm. ? 2000 Elsevier Science B.V. All rights reserved.
متن کاملISSN 0333-3590 A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
An independent dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D and D is an independent set, i.e. no two vertices in D are adjacent. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it is hard to cope with this problem using parameterized and approximation algorithms, there is a s...
متن کاملA Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it is hard to cope with this problem using parameterized and approximation algorithms, there is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15093-3301